Minimal Weight in Union-Closed Families
نویسنده
چکیده
Let Ω be a finite set and let S ⊆ P(Ω) be a set system on Ω. For x ∈ Ω, we denote by dS(x) the number of members of S containing x. A long-standing conjecture of Frankl states that if S is union-closed then there is some x ∈ Ω with dS(x) ≥ 12 |S|. We consider a related question. Define the weight of a family S to be w(S) := ∑ A∈S |A|. Suppose S is union-closed. How small can w(S) be? Reimer showed w(S) ≥ 1 2 |S| log2 |S|, and that this inequality is tight. In this paper we show how Reimer’s bound may be improved if we have some additional information about the domain Ω of S: if S separates the points of its domain, then w(S) ≥ (|Ω| 2 )
منابع مشابه
Random Union-Closed Families
We shall show that the union-closed families conjecture holds for a random union-closed family with high probability. This strengthens a recent result of Bruhn and Schaudt.
متن کاملAssessment of the treatment outcome of closed extra-articular distal tibia fracture: IM nailing vs plating
Abstract Background: The tibial diaphyseal fractures are the most common type of long bone fractures encountered by most orthopedic surgeons. In accordance with descriptive indices of tibia fractures on the basis of their location in the bone, distal tibia fractures have the second incidence of all tibia fractures after the middle tibia fractures. The purpose of the study was to asses...
متن کاملComputing Planar Intertwines
The proof of Wagner's Conjecture by Robertson and Seymour gives a nite description of any family of graphs which is closed under the minor ordering. This description is a nite set of graphs called the obstructions of the family. Since the intersection and the union of two minor closed graph families is again a minor closed graph family, an interesting question is that of computing the obstructi...
متن کاملNote on the Union-Closed Sets Conjecture
The union-closed sets conjecture states that if a finite family of sets A 6 = {∅} is union-closed, then there is an element which belongs to at least half the sets in A. In 2001, D. Reimer showed that the average set size of a union-closed family, A, is at least 1 2 log2 |A|. In order to do so, he showed that all union-closed families satisfy a particular condition, which in turn implies the pr...
متن کاملOn averaging Frankl's conjecture for large union-closed-sets
Let F be a union-closed family of subsets of an m-element set A. Let n = |F| ≥ 2 and for a ∈ A let s(a) denote the number of sets in F that contain a. Frankl’s conjecture from 1979, also known as the union-closed sets conjecture, states that there exists an element a ∈ A with n − 2s(a) ≤ 0. Strengthening a result of Gao and Yu [7] we verify the conjecture for the particular case when m ≥ 3 and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011